Approval Voting Theory with Multiple Levels of Approval
نویسندگان
چکیده
Approval voting is an election method in which voters may cast votes for as many candidates as they desire. This can be modeled mathematically by associating to each voter an approval region: a set of potential candidates they approve. In this thesis we add another level of approval somewhere in between complete approval and complete disapproval. More than one level of approval may be a better model for a real-life voter’s complex decision making. We provide a new definition for intersection that supports multiple levels of approval. The case of pairwise intersection is studied, and the level of agreement among voters is studied under restrictions on the relative size of each voter’s preferences. We derive upper and lower bounds for the percentage of agreement based on the percentage of intersection.
منابع مشابه
Computational Aspects of Multi-Winner Approval Voting
We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...
متن کاملCriticality in games with multiple levels of approval
In this paper criticality within a voting game is rigorously defined and examined. Criticality forms the basis of the traditional voting power measures frequently employed to analyse voting games; therefore understanding criticality is a pre-requisite to understanding any such analysis. The concept of criticality is extended to encompass games in which players are allowed to express multiple le...
متن کاملApproval voting and scoring rules with common values
We compare approval voting with other scoring rules for environments with common values and private information. For finite electorates, the best equilibrium under approval voting is superior to plurality rule or negative voting. For large electorates, if any scoring rule yields a sequence of equilibria that aggregates information, then approval voting must do so as well.
متن کاملSur les aspects computationnels du vote par approbation. (Computational Aspects of Approval Voting)
The subject of this thesis is the study of computational aspects of approval voting. Mostof the works are theoretical results about computational issues raised by approval voting, in manydi erent settings. Indeed, I use algorithmic techniques like polynomial reductions to prove that manyproblems are di cult to solve in the context of approval voting. However, I also study some quest...
متن کاملComputational Aspects of Approval Voting and Declared-strategy Voting
OF THE DISSERTATION Computational Aspects of Approval Voting and Declared-Strategy Voting by Robert Hampton LeGrand III May 2008 Washington University St. Louis, Missouri Professor Ron K. Cytron, Chairperson Computational social choice is a relatively new discipline that explores issues at the intersection of social choice theory and computer science. Designing a protocol for collective decisio...
متن کامل